#include <iostream>
using namespace std;

int main()
{
    cout << 123 << endl;
    return 0;
}
/*


class Solution {
public:
void preorder(vector<int>& vi, TreeNode* root)
{
    if (root == nullptr)
        return;
    vi.push_back(root->val);
    preorder(vi, root->left);
    preorder(vi, root->right);
}

vector<int> preorderTraversal(TreeNode* root) {
    vector<int> vi;
    preorder(vi, root);
    return vi;
}
};


class Solution {
public:

void inorder(vector<int>& vi, TreeNode* root)
{
    if (root == nullptr)
        return;
    inorder(vi, root->left);
    vi.push_back(root->val);
    inorder(vi, root->right);
}
vector<int> inorderTraversal(TreeNode* root) {
    vector<int> vi;
    inorder(vi, root);
    return vi;
}
};







*/